Termination w.r.t. Q proof of TRS/SK904.25.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

rev(a) → a
rev(b) → b
rev(++(x, y)) → ++(rev(y), rev(x))
rev(++(x, x)) → rev(x)

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

rev(a) → a
rev(b) → b
rev(++(x, y)) → ++(rev(y), rev(x))
rev(++(x, x)) → rev(x)

Q is empty.

We use [23] with the following order to prove termination.

Recursive Path Order [2].
Precedence:

rev₁ > ++₂